πŸ‘©β€πŸ’» 17676. 좔석 νŠΈλž˜ν”½

@Seongukbaek Posted May 18, 2022 Β· Updated May 18, 2022 Β· 3 min read

문제

Programmers - 좔석 νŠΈλž˜ν”½

πŸ“ Logic

private void getTime(String[] doneTime, int procTime) { int hour = Integer.parseInt(doneTime[0]); int min = Integer.parseInt(doneTime[1]); int sec = (int) (Double.parseDouble(doneTime[2]) * 1000); int endSec = hour * 1000 * 60 * 60 + min * 1000 * 60 + sec; int startSec = endSec - procTime + 1; times.add(new Time(startSec, endSec)); }
  • λ¬Έμžμ—΄μ„ νŒŒμ‹±ν•˜μ—¬ μ‹œ, λΆ„, 초 λ‹¨μœ„λ‘œ λ³€ν™˜ ν›„ 이λ₯Ό μ •μˆ˜λ‘œ λ³€ν™˜
private int findMaxRequest(int startTime) { int count = 0; // start ~ end 사이에 μžˆλ‹€λ©΄ count + 1; int endTime = startTime + 1000; for (Time time : times) { if (startTime <= time.startSec && time.startSec < endTime) { count++; } else if (startTime <= time.endSec && time.endSec < endTime) { count++; } else if (endTime <= time.endSec && time.startSec <= startTime) { count++; } } return count; }
  • μ£Όμ–΄μ§„ μ‹œκ°„μ€ 둜그의 μ‹œμž‘ μ‹œκ°„ λ˜λŠ” μ’…λ£Œ μ‹œκ°„

    • ν•΄λ‹Ή μ‹œκ°„μœΌλ‘œλΆ€ν„° 1초 내에 λ‹€λ₯Έ λ‘œκ·Έκ°€ μ‘΄μž¬ν•œλ‹€λ©΄ count λ₯Ό 증가

πŸ“„ CODE

μ½”λ“œ 보기/μ ‘κΈ°πŸ’«
import java.util.*; class Time { int startSec; int endSec; public Time(int startSec, int endSec) { this.startSec = startSec; this.endSec = endSec; } } class Solution { ArrayList<Time> times = new ArrayList<>(); public int solution(String[] lines) { // 둜그 κ°œμˆ˜κ°€ 1개면 무쑰건 1 λ°˜ν™˜ if (lines.length == 1) return 1; for (String line : lines) { String[] times = line.substring(11).split(" "); String[] doneTime = times[0].split(":"); int procTime = (int) (Double.parseDouble(times[1].replace("s", "")) * 1000); getTime(doneTime, procTime); } int max = 0; // μ‹œμž‘μ μ΄ κ±Έμ³μžˆλŠ” κ²½μš°μ™€ 끝점이 κ±Έμ³μžˆλŠ” 경우, time의 start와 endλ₯Ό 기점으둜 1초 μ•ˆμ— λͺ‡κ°œμ˜ μš”μ²­μ΄ μ²˜λ¦¬λ˜λŠ”μ§€ 카운트 for (Time time : times) max = Math.max(max, Math.max(findMaxRequest(time.startSec), findMaxRequest(time.endSec))); return max; } // μ‹œμž‘ μ‹œκ°„κ³Ό μ’…λ£Œ μ‹œκ°„μ„ κ΅¬ν•΄μ„œ ArrayList에 μΆ”κ°€ private void getTime(String[] doneTime, int procTime) { int hour = Integer.parseInt(doneTime[0]); int min = Integer.parseInt(doneTime[1]); int sec = (int) (Double.parseDouble(doneTime[2]) * 1000); int endSec = hour * 1000 * 60 * 60 + min * 1000 * 60 + sec; int startSec = endSec - procTime + 1; times.add(new Time(startSec, endSec)); } private int findMaxRequest(int startTime) { int count = 0; // start ~ end 사이에 μžˆλ‹€λ©΄ count + 1; int endTime = startTime + 1000; for (Time time : times) { if (startTime <= time.startSec && time.startSec < endTime) { count++; } else if (startTime <= time.endSec && time.endSec < endTime) { count++; } else if (endTime <= time.endSec && time.startSec <= startTime) { count++; } } return count; } }

✏️ Review

  • λ¬Έμžμ—΄ νŒŒμ‹±ν•˜λŠ” κ³Όμ •λΆ€ν„° λ§ˆμŒμ— λ“€μ§€ μ•Šμ€ λ¬Έμ œμ˜€κ³ , μ• λ§€ν•œ μ„€λͺ…λ•Œλ¬Έμ— 이해가 더 κ°€μ§€ μ•Šμ•˜λ‹€.
  • μ²˜μŒμ—λŠ” 초 λ‹¨μœ„μ˜ μ •λ³΄λ§Œμ„ κ°€μ§€κ³  문제λ₯Ό ν•΄κ²°ν•˜λ €λ‹€κ°€ μ•„μ°¨ μ‹Άμ—ˆλ‹€.
  • 데이터 ν˜• λ³€ν™˜ λ˜ν•œ μ’€ 더 꼼꼼히 ν™•μΈν•˜λŠ” μŠ΅κ΄€μ„ κ°€μ Έμ•Όκ² λ‹€.
@Seongukbaek
배우고 μ •λ¦¬ν•˜κ³  κ³΅μœ ν•˜λŠ” λŒ€ν•™μƒ λ°±μ„±μš±μž…λ‹ˆλ‹€ πŸ˜€